搜索资源列表
BackTrack_01backpack
- 0-1背包问题是一个经典的算法问题，有多种解法，这里用回溯法求解。-0-1 knapsack problem is a classical algorithm for the problem, there are several solution here solved by backtracking.
0-1hui
- 0-1背包问题 关于回溯法的背包问题 回溯法在求问题的所有解时, 要回溯到根结点, 且根结点的所有子树都已被搜索过才结束。-0-1 背包问题
1
- 贪心算法0-1背包问题，很全面，很有用的-beibao
0-1question
- 0-1背包问题是算法设计中很经典的一个问题。如何让价值最大化是这个问题所要考虑的问题。-0-1 knapsack problem is a classic algorithm design a problem. How to maximize the value of this issue to consider.
beibaoPSO
- 这份源代码是用粒子群算法解决0/1背包问题，可以正常运行。-The source code is the particle swarm algorithm to solve 0/1 knapsack problem, it works.
Backtrack_0-1bag
- 从文件读入数据，用回溯法实现了0-1背包最优解的问题-Read data from a file, using backtracking to achieve the optimal solution of the 0-1 knapsack problem
0-1beibao
- 这是用贪心算法解决0-1背包问题的一个算法源码-something about 0-1 knapsack problems
1
- 0/1背包问题，C++实现，算法实现源代码，蛮力法实现源程序，-0/1 knapsack problem, C++ implementation, algorithm source code, brute force method to achieve source,
0-1_bag_problem
- 0-1背包问题的动态规划解法，C++源码，并附有详细的实验报告-0-1 bag problem
0-1bag-question
- 0-1背包问题 一种简单的算法 用c++实现的源代码-0-1bag question
0-1beibao
- 0-1背包问题，很经典的一个问题，基于动态规划的经典案例。-0-1 knapsack problem, it is a problem in the classic, classic case based on dynamic programming.
1.tar
- 用C++实现的0-1背包问题的动态规划解法程序。注释详实，可读性好。-C++ implementation with the 0-1 knapsack problem dynamic programming solution procedure. Comments detailed, readable.
1
- 遗传算法解决0-1背包问题，动态规划算法-Genetic algorithm to solve 0-1 knapsack problem, dynamic programming algorithm
1
- 用回溯法解决0-1背包问题，用回溯法解决0-1背包问题-用回溯法解决0-1背包问题
0-1bag
- 解决0-1背包问题的几种方法，有回溯，有优先分支界限，是一个实验报告的格式-0-1 knapsack problem to solve several methods, there are retrospective, have priority branch and bound, the format of a lab report
ACG0-1
- 蚁群求解TSP问题，和0-1背包问题，不错，运行结果可以-ACO for TSP, and the 0-1 knapsack problem, yes, the results can be
0-1beibao
- 算法与分析中0/1背包问题的实现，求出最大价值及所放入的背包序号-Algorithms and Analysis 0/1 knapsack problem to achieve, find the maximum value and the serial number into the backpack
0-1bag
- 解决了0-1背包问题，能够的出最优解；并且可以知道各个背包的号码和总重量。-To solve the 0-1 knapsack problem, to the optimal solution and can know each number and total weight of the backpack.
0-1beibao
- 蚁群算法求解0-1背包问题，压缩包中有详细的代码和实验报告，可以调试运行-Ant Colony Algorithm for the 0-1 knapsack problem, compressed package are detailed in the code and lab reports, debugging and running
huisufa0-1
- 算法分析-回溯法，0-1背包问题，按选优条件向前搜索，以达到目标。-Algorithm- Backtracking，0-1Knapsack problem，Forward search, the optimal selection conditions in order to achieve the goal.